Modeling and Optimization of Cloud-Ready and Content-Oriented Networks by Krzysztof Walkowiak

Author:Krzysztof Walkowiak
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

Note that the FPCSpectrum() function can be modified easily to optimize other objective functions. In the following, Algorithm 3.6 shows an analogous function designed to optimize the network cost according to optimization model (3.3.3).

In Algorithm 3.4, we present the pseudocode of algorithm LPF/AU/RSA. The aim of this method is to process the demands in a certain order. Here, the demand path length is applied as a sorting metric. More precisely, for each demand d metric denotes the hop count of the shortest path included in set P(d). The demands are processed in decreasing order of values. The aim of this approach is to process demands that use longer paths (with more hops), since they consume more spectrum. Therefore, the demands are sorted using the function (line 2). Next, the demands are processed in a single run using this ordering in the main loop of the algorithm (lines 3–16). However, anycast and unicast demands are processed using a different method, which accounts for the anycast constraint (3.3.1e) active only for anycast demands. More precisely, if demand d is an anycast demand two cases are considered. Firstly, if the associated demand is not already established in the network, the path and channel are selected with FPCSpectrum(P(d), C(d, p)), using all candidate paths included in set P(d) (lines 6–8). However, if the associated demand is already established in the network, demand d must be connected to the same DC node as . Therefore, in this case the path and channel are selected with FPCSpectrum(P(d, r), C(d, p)), but using candidate paths with the same DC node as demand , i.e., the path included in set P(d, r) (lines 9–12). For unicast demands, the processing is straightforward (line 14). The function is run to allocate the analyzed demand on the selected path and channel (line 15). Note that the complexity of algorithm LPF/AU/RSA is bound by .

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.